The Partially Observed Stochastic Minimum Principle
نویسندگان
چکیده
منابع مشابه
On Partially Observed Stochastic Shortest Path Problems
We analyze a class of partially observed stochastic shortest path problems. These are terminating Markov decision process with imperfect state information that evolve on an innnite time horizon and have a total cost criterion. For well-posedness, we make reasonable stochastic shortest path type assumptions: (1) the existence of a policy that guarantees termination with probability one and (2) t...
متن کاملfor discrete - time partially observed stochastic systems
A discrete-time stochastic control problem for general (nonlinear in state, control, observation and noise) models is considered. The same noise can enter into the state and into the observation equations, and the state/observation does not need to be affine with respect to the noise. Under mild assumptions the joint distribution function of the state/observation processes is obtained and used ...
متن کاملPartially observed branching processes for stochastic epidemics.
At the offset of a (stochastic) epidemic, it is of importance to have a mathematical model that will assist in the making of an informed judgement on whether the epidemic will explode, or will be minor and die out. In this paper, we consider probabilistic inferences related to the event of extinction of a discrete time branching process when this cannot be directly observed. Instead, we are abl...
متن کاملA separation principle for partially observed control of singular stochastic processes
The analysis of partially observed stochastic control problems often replaces the unknown state process with its conditional distribution given the observations. This technique rewrites the dynamics in terms of knowable processes whose costs coincide with the original processes. This paper considers stochastic processes having singular behavior and presents an approach which separates the deter...
متن کاملA Class of Tractable Partially Observed Discrete Stochastic Games
Stochastic games under partial information are typically computationally intractable even in the discrete-time/discrete-state case considered here. We consider a problem where one player has perfect information. A chief problem is that the information state for the player with imperfect information is a function over the space of probability distributions (a function over a simplex), and so inf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 1989
ISSN: 0363-0129,1095-7138
DOI: 10.1137/0327065